Faster bottleneck non-crossing matchings of points in convex position
نویسندگان
چکیده
منابع مشابه
Faster bottleneck non-crossing matchings of points in convex position
Given an even number of points in a plane, we are interested in matching all the points by straight line segments so that the segments do not cross. Bottleneck matching is a matching that minimizes the length of the longest segment. For points in convex position, we present a quadratic-time algorithm for finding a bottleneck non-crossing matching, improving upon the best previously known algori...
متن کاملNon-crossing Bottleneck Matchings of Points in Convex Position
Given an even number of points in a plane, we are interested in matching all the points by straight line segments so that the segments do not cross. Bottleneck matching is a matching that minimizes the length of the longest segment. For points in convex position, we present a quadratic-time algorithm for finding a bottleneck non-crossing matching, improving upon the best previously known algori...
متن کاملDisjoint compatibility graph 1 of non - crossing matchings 2 of points in convex position
6 Let X2k be a set of 2k labeled points in convex position in the plane. We consider geometric 7 non-intersecting straight-line perfect matchings of X2k. Two such matchings, M and M , are 8 disjoint compatible if they do not have common edges, and no edge of M crosses an edge of M . 9 Denote by DCMk the graph whose vertices correspond to such matchings, and two vertices 10 are adjacent if and o...
متن کاملDisjoint Compatibility Graph of Non-Crossing Matchings of Points in Convex Position
Let X2k be a set of 2k labeled points in convex position in the plane. We consider geometric non-intersecting straight-line perfect matchings of X2k. Two such matchings, M and M ′, are disjoint compatible if they do not have common edges, and no edge of M crosses an edge of M ′. Denote by DCMk the graph whose vertices correspond to such matchings, and two vertices are adjacent if and only if th...
متن کاملBottleneck Bichromatic Non-crossing Matchings using Orbits
Let R and B be sets of n red and n blue points in the plane, respectively, with P = R∪ B. Let M be a perfect matching between points from R and B, using n straight line segments to match the points, that is, each point is an endpoint of exactly one line segment, and each line segment has one red and one blue endpoint. We forbid line segments to cross. Denote the length of a longest line segment...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2017
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2017.05.002